On Higher Order Recursive Program Schemes
نویسنده
چکیده
We deene Higher Order Recursive Program Schemes (HRPSs) by allowing metasubstitutions (as in the-calculus) in right-hand sides of function and quantiier deenitions. A study of several kinds of similarity of redexes makes it possible to lift properties of ((rst order) Recursive Program Schemes to the higher order case. The main result is the decidability of weak normalization in HRPSs, which immediately implies that HRPSs do not have full computational power. We analyze the structural properties of HRPSs and introduce several kinds of persistent expression reduction systems (PERSs) that enjoy similar properties. Finally, we design an optimal evaluation procedure for PERSs.
منابع مشابه
Higher type recursive program schemes and the nested pushdown automaton
When implementing recursive programs on a standard von Neumann random access machine (RAM) it is natural and well known how to use a pushdown store in order to keep track of the recursive procedure calls when the program runs. The more abstract world of program schemes abounds with examples of this pushdown – recursion relation. As a concrete example it is well known how to implement monadic re...
متن کاملRecursive Schemes, Krivine Machines, and Collapsible Pushdown Automata
Higher-order recursive schemes offer an interesting method of approximating program semantics. The semantics of a scheme is an infinite tree labeled with built-in constants. This tree represents the meaning of the program up to the meaning of built-in constants. It is much easier to reason about properties of such trees than properties of interpreted programs. Moreover some interesting properti...
متن کاملThe Category Theoretic Solution of Recursive Program Schemes
This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoretic version of the classical area of algebraic semantics. The overall assumptions needed are small indeed: working only in categories with “enough final coalgebras” we show how to formulate, solve, and study recursive p...
متن کاملRefactoring for Comprehension
Functional programming is well suited for equational reasoning on programs. In this paper, we are trying to use this capability for program comprehension purposes. Specifically, in a program understanding process, higher-order operators can work like abstract schemes in which we can fit formal specifications calculated from the source code. Such specifications are calculated by a transformation...
متن کاملModel Checking and Functional Program Transformations
We study a model for recursive functional programs called higher order recursion schemes (HORS). We give new proofs of two verification related problems: reflection and selection for HORS. The previous proofs are based on the equivalence between HORS and collapsible pushdown automata and they lose the structure of the initial program. The constructions presented here are based on shape preservi...
متن کامل